| 1. Yu X, Qiao C M, Wang T, et al. Survivable logical topology design for distributed computing in WDM networks. Proceedings of the Optical Fiber Communication/National Fiber Optic Engineers Conference (OFC/NFOEC’09), Mar 24-26, 2009, San Diego, CA, USA. Piscataway, NJ, USA: IEEE, 2009: OMO3
2. Modiano E, Narula-Tam A. Survivable lightpath routing: a new approach to the design of WDM-based networks. IEEE Journal on Selected Areas in Communications, 2002, 20 (4): 800-809
3. Kurant M, Thiran P. Survivable routing of mesh topologies in IP-over-WDM networks by recursive graph contraction. IEEE Journal on Selected Area in Communications, 2007, 25(5): 922-933
4. Liu C, Lu R. A new survivable mapping problem in IP-over-WDM networks. IEEE Journal on Selected Area in Communications, 2007, 25(4): 25-34
5. Din D R. A genetic algorithm for solving virtual topology configuration transition problem in WDM network. Computer Communications, 2007, 30(4): 767-781
6. Banerjee D, Mukherjee B. Wavelength-routed optical networks: linear formulation, resource budgeting tradeoffs, and a reconfiguration study. IEEE/ACM Transactions on Networking, 2000, 8 (5): 598-607
7. Gencata A, Mukherjee B. Virtual-topology adaptation for WDM mesh networks under dynamic traffic. IEEE/ACM Transactions on Networking, 2003, 11(2): 236-247
8. Almeidaa R T R, Calmonb L D, Segatto M E V, et al. Design of virtual topologies for large optical networks through an efficient MILP formulation. Optical Switching and Networking, 2006, 3(1): 2-106
9. Deo N. Graph theory with application to engineering and computer science. Englewood Cliffs, NJ, USA: Prentice-Hall, 2000
10. Karp R M. Reducibility among combinatorial problems. Complexity of Computer Computation, 1972, 40(4): 85-103
11. Chvatal V. A greedy heuristic for the set-covering problem. Mathematics of Operations Research, 1979, 4(3): 233-235
12. Chandra B, Halldorsson M M. Greedy local improvement and weighted set packing approximation. Journal of Algorithms, 2001, 39(2): 223-240 |
